The Effect of Skewed Data Access on Buffer Hits and Data Contention an a Data Sharing Environment
نویسندگان
چکیده
In this paper we examine the effect of skewed access on the buffer hit ratio in a multi-system data sharing environment, where each computing node has access to shared data on disks, and has a local buffer of recently accessed granules. In the literature, the effect of skewness in data access on increased data contention has been examined, since with skew most accesses go to few data items. For the same reason, skewness can also increase the buffer hit probability, alleviating the effect on data contention. We examine the resultant effect on the transaction response time, which depends not only on the various system parameters but also on the Concurrency Control (CC) protocol. Furthermore, the CC protocol can give rise to rerun transactions that have different buffer hit probabilities. In a multi-system environment, when a data block gets updated by a system, copies of that block in other system’s local buffers are invalidated. We develop a comprehensive analytical buffer model that captures all these effects and integrate it with a CC model to estimate the overall transaction response time. The model is validated through simulations. We find that higher skew does not necessarily lead to worse performance, and that with skewed access optimistic CC is more robust than pessimistic CC. Examining the buffer hit probability as a function of the buffer size, we find that the effectiveness of additional buffer allocation can be broken down into multiple regions that depend on the degree of skewness. Permission to copq without fee all or part of this material ih granted provided that the copich nre not made or clistrihutcd for direct commercial advantage. the VLDB copyright notice and the title of the publication and its date nppcar. and notice ia gi\cn that copying is by permission of the Vu) Large Data Raw Endowment. To copy otherwise. or to republish. rcquirca :I fee and/or special permission from the Endowment. Proceedings of the 16th VLDB Conferen,ce Brisbane, Australia 1990
منابع مشابه
ارایه یک روش جدید انتشار دادهها با حفظ محرمانگی با هدف بهبود دقّت طبقهبندی روی دادههای گمنام
Data collection and storage has been facilitated by the growth in electronic services, and has led to recording vast amounts of personal information in public and private organizations databases. These records often include sensitive personal information (such as income and diseases) and must be covered from others access. But in some cases, mining the data and extraction of knowledge from thes...
متن کاملAn Efficient Secret Sharing-based Storage System for Cloud-based Internet of Things
Internet of things (IoTs) is the newfound information architecture based on the internet that develops interactions between objects and services in a secure and reliable environment. As the availability of many smart devices rises, secure and scalable mass storage systems for aggregate data is required in IoTs applications. In this paper, we propose a new method for storing aggregate data in Io...
متن کاملAn Incentive-Aware Lightweight Secure Data Sharing Scheme for D2D Communication in 5G Cellular Networks
Due to the explosion of smart devices, data traffic over cellular networks has seen an exponential rise in recent years. This increase in mobile data traffic has caused an immediate need for offloading traffic from operators. Device-to-Device(D2D) communication is a promising solution to boost the capacity of cellular networks and alleviate the heavy burden on backhaul links. However, dir...
متن کاملThe effect of organizational climate and knowledge sharing on the innovative behavior of employees in knowledge-based companies
Purpose. The ultimate goal of innovative behavior is to improve performance of the individual, group, and ultimately organization all together. Many factors are influential in the realization of innovative behavior of employees of an organization. In this study, the influence of two factors of organizational climate and knowledge sharing has been reflected. Method. The study uses an applied des...
متن کاملDynamic Replication based on Firefly Algorithm in Data Grid
In data grid, using reservation is accepted to provide scheduling and service quality. Users need to have an access to the stored data in geographical environment, which can be solved by using replication, and an action taken to reach certainty. As a result, users are directed toward the nearest version to access information. The most important point is to know in which sites and distributed sy...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990